منابع مشابه
Forward Bisimulations for Nondeterministic Symbolic Finite Automata
Symbolic automata allow transitions to carry predicates over rich alphabet theories, such as linear arithmetic, and therefore extend classic automata to operate over infinite alphabets, such as the set of rational numbers. Existing automata algorithms rely on the alphabet being finite, and generalizing them to the symbolic setting is not a trivial task. In our earlier work, we proposed new tech...
متن کاملSymbolic Models for Nonlinear Control Systems: Alternating Approximate Bisimulations
Symbolic models are abstract descriptions of continuous systems in which symbols represent aggregates of continuous states. In the last few years there has been a growing interest in the use of symbolic models as a tool for mitigating complexity in control design. In fact, symbolic models enable the use of well known algorithms in the context of supervisory control and algorithmic game theory, ...
متن کاملComputing Bisimulations for Stochastic Process Algebras using Symbolic Representations
Stochastic process algebras have been introduced in order to enable compositional performance analysis. The size of the state space is a limiting factor, especially if the system consists of many cooperating components. To fight state space explosion, various proposals for compositional aggregation have been made. They rely on minimisation with respect to a congruence relation. This paper addre...
متن کاملSymbolic Bisimulations and Proof Systems for the π-Calculus
A theory of symbolic bisimulation for the π-calculus is proposed which captures the conventional notions of bisimulation-based equivalences for this calculus. Proof systems are presented for both late and early equivalences, and their soundness and completeness are proved. The proof system for early equivalence differs from that for late equivalence only in the inference rule for input prefixin...
متن کاملSymbolic models for nonlinear time-delay systems using approximate bisimulations
In this paper we show that incrementally stable nonlinear time–delay systems admit symbolic models which are approximately equivalent, in the sense of approximate bisimulation, to the original system. An algorithm is presented which computes the proposed symbolic models. Termination of the algorithm in a finite number of steps is guaranteed by a boundedness assumption on the state and input spa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1995
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00172-f